Generalized thurstone models for ranking: Equivalence and reversibility

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameter Estimation for Generalized Thurstone Choice Models

We consider the maximum likelihood parameter estimation problem for a generalized Thurstone choice model, where choices are top-1 items from comparison sets of two or more items. We provide tight characterizations of the mean square error, as well as necessary and sufficient conditions for correct classification when each item belongs to one of two classes. These results provide insights into h...

متن کامل

Supplementary Material:Parameter Estimation for Generalized Thurstone Choice Models

Let cov[Y ] denote the covariance matrix of a multivariate random variable Y , i. Proposition 7 (Cramér-Rao inequality). Suppose that X is a multivariate random variable with distribution p(x; θ), for parameter θ ∈ Θ n , and let T(X) = (T 1 (X),. .. , T r (X)) be any unbiased estimator of ψ(θ) = (ψ 1

متن کامل

Asymptotic equivalence for nonparametric generalized linear models

We establish that a non-Gaussian nonparametric regression model is asymptotically equivalent to a regression model with Gaussian noise. The approximation is in the sense of Le Cam's de®ciency distance D; the models are then asymptotically equivalent for all purposes of statistical decision with bounded loss. Our result concerns a sequence of independent but not identically distributed observati...

متن کامل

Reversibility and Models for Concurrency

There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [2] and CCSK [8] were developed and general techniques for reversing other process operators were proposed. The paper shows that the notion of reversibility can bridge the gap between some interleaving models and non-int...

متن کامل

Logical equivalence between generalized urn models and finite automata

To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Psychology

سال: 1980

ISSN: 0022-2496

DOI: 10.1016/0022-2496(80)90046-2